Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(x,a(b(y))) |
→ f(a(a(x)),y) |
| 2: |
|
f(x,b(a(y))) |
→ f(b(b(x)),y) |
| 3: |
|
f(a(x),y) |
→ f(x,a(y)) |
| 4: |
|
f(b(x),y) |
→ f(x,b(y)) |
|
There are 4 dependency pairs:
|
| 5: |
|
F(x,a(b(y))) |
→ F(a(a(x)),y) |
| 6: |
|
F(x,b(a(y))) |
→ F(b(b(x)),y) |
| 7: |
|
F(a(x),y) |
→ F(x,a(y)) |
| 8: |
|
F(b(x),y) |
→ F(x,b(y)) |
|
The approximated dependency graph contains one SCC:
{5-8}.
-
Consider the SCC {5-8}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006